A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed
نویسندگان
چکیده
C1) S c V ( T ) c A1 x . . . x A,, W e present a polynomial-t ime algorithm f o r determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the max imum number of possible s ta tes f o r a charact e r is fixed. Th i s solves a longstanding open problem. O u r result should be contrasted wi th the proof by Steel and Bodlaender, Fellows, and W a m o w that the perfect phylogeny problem i s NP-complete in general.
منابع مشابه
Haplotype Block Partitioning and tagSNP Selection under the Perfect Phylogeny Model
Single Nucleotide Polymorphisms (SNPs) are the most usual form of polymorphism in human genome.Analyses of genetic variations have revealed that individual genomes share common SNP-haplotypes. Theparticular pattern of these common variations forms a block-like structure on human genome. In this work,we develop a new method based on the Perfect Phylogeny Model to identify haplo...
متن کاملA Polynomial-Time Algorithm for the Phylogeny Problem when the Number of Character States is Fixed
We present a polynomial-time algorithm for determining whether a set of species, described by the characters they exhibit, has a phylogenetic tree, assuming the maximum number of possible states for a character ix fixed. This solves an open problem posed by Kannan and Warnow. Our result should be contrasted with the proof by Steel and Bodlænder, Fellows, and Warnow that the phylogeny problem is...
متن کاملFPT Algorithms for Binary Near-Perfect Phylogenetic Trees
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character states (referred to as BNPP). A perfect phylogeny assumes that every character mutates at most once in the evolutionary tree, yielding an algorithm for binary character states that is computationally efficient but not robust to imperfections in real data. A near-perfect phylogeny relaxes the perfect...
متن کاملAlgorithms for the Constrained Perfect Phylogeny with Persistent Characters
The perfect phylogeny is one of the most used models in different areas of computational biology. In this paper we consider the problem of the Persistent Perfect Phylogeny (referred as P-PP) recently introduced to extend the perfect phylogeny model allowing persistent characters, that is characters can be gained and lost at most once. We define a natural generalization of the P-PP problem obtai...
متن کاملSimple Reconstruction of Binary Near-Perfect Phylogenetic Trees
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character states (referred to as BNPP). A perfect phylogeny assumes that every character mutates at most once in the evolutionary tree, yielding an algorithm for binary character states that is computationally efficient but not robust to imperfections in real data. A near-perfect phylogeny relaxes the perfect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993